This
TiddlyWiki
contains the following tiddlers:
?
$:/2022黄皮书考研一大纲词汇背诵宝典/and
$:/2022黄皮书考研一大纲词汇背诵宝典/at
$:/2022黄皮书考研一大纲词汇背诵宝典/in
$:/2022黄皮书考研一大纲词汇背诵宝典/of
$:/2022黄皮书考研一大纲词汇背诵宝典/or
$:/2022黄皮书考研一大纲词汇背诵宝典/the
$:/2022黄皮书考研一大纲词汇背诵宝典/to
$:/2022黄皮书考研一大纲词汇背诵宝典/you
$:/config/codemirror/autoCloseTags
$:/config/codemirror/keyMap
$:/config/FileSystemPaths
$:/config/Navigation/openLinkFromInsideRiver
$:/config/Navigation/openLinkFromOutsideRiver
$:/config/PageControlButtons/Visibility/$:/core/ui/Buttons/close-all
$:/config/PageControlButtons/Visibility/$:/core/ui/Buttons/full-screen
$:/config/PageControlButtons/Visibility/$:/core/ui/Buttons/refresh
$:/config/PageControlButtons/Visibility/$:/core/ui/Buttons/storyview
$:/config/PageControlButtons/Visibility/$:/core/ui/Buttons/tag-manager
$:/config/PageControlButtons/Visibility/$:/core/ui/Buttons/timestamp
$:/config/Plugins/Disabled/$:/plugins/oflg/fishing-cannedfish/2022黄皮书考研一大纲词汇背诵宝典
$:/config/RelinkOnRename
$:/config/shortcuts/transcludify
$:/config/ViewToolbarButtons/Visibility/$:/core/ui/Buttons/export-tiddler
$:/config/ViewToolbarButtons/Visibility/$:/core/ui/Buttons/info
$:/DefaultTiddlers
$:/favorites/favlist
$:/isEncrypted
$:/language
$:/languages/zh-Hans
$:/layout
$:/palette
$:/plugins/bimlas/kin-filter
$:/plugins/bimlas/locator
$:/plugins/dullroar/sitemap
$:/plugins/felixhayashi/hotzone
$:/plugins/felixhayashi/tiddlymap
$:/plugins/felixhayashi/tiddlymap/graph/nodeTypes/tmap:central-topic
$:/plugins/felixhayashi/tiddlymap/graph/nodeTypes/tmap:neighbour
$:/plugins/felixhayashi/tiddlymap/graph/views/Default/filter/edges
$:/plugins/felixhayashi/tiddlymap/graph/views/Default/filter/nodes
$:/plugins/felixhayashi/tiddlymap/graph/views/Default/map
$:/plugins/felixhayashi/tiddlymap/graph/views/Live View
$:/plugins/felixhayashi/tiddlymap/graph/views/Live View/filter/edges
$:/plugins/felixhayashi/tiddlymap/misc/defaultViewHolder
$:/plugins/felixhayashi/tiddlymap/misc/meta
$:/plugins/felixhayashi/topstoryview
$:/plugins/felixhayashi/vis
$:/plugins/flibbles/relink
$:/plugins/flibbles/relink-markdown
$:/plugins/flibbles/relink-titles
$:/plugins/Gk0Wk/echarts
$:/plugins/Gk0Wk/echarts-gl
$:/plugins/Gk0Wk/echarts-graph-modularity
$:/plugins/Gk0Wk/echarts-liquidfill
$:/plugins/Gk0Wk/echarts-stat
$:/plugins/Gk0Wk/echarts/addons/TheBrain.js
$:/plugins/Gk0Wk/notionpage-covericon
$:/plugins/Gk0Wk/page-toc
$:/plugins/Gk0Wk/sidebar-resizer
$:/plugins/Gk0Wk/TW5-CodeMirror-Enhanced
$:/plugins/gt6796c/mermaid-tw5
$:/plugins/gt6796c/rocklib
$:/plugins/kookma/commander
$:/plugins/kookma/favorites
$:/plugins/kookma/favorites/recent
$:/plugins/kookma/hsl
$:/plugins/kookma/refnotes
$:/plugins/kookma/shiraz
$:/plugins/kookma/solution
$:/plugins/kookma/tamasha
$:/plugins/kookma/todolist
$:/plugins/kookma/utility
$:/plugins/linonetwo/commandpalette
$:/plugins/linonetwo/copy-on-select
$:/plugins/linonetwo/github-external-image
$:/plugins/linonetwo/inverse-link-and-folder
$:/plugins/linonetwo/itonnote
$:/plugins/linonetwo/open-in-external-app
$:/plugins/linonetwo/opened-tiddlers-bar
$:/plugins/linonetwo/pinyin-fuzzy-search
$:/plugins/linonetwo/prevent-edit
$:/plugins/linonetwo/preview-glass
$:/plugins/linonetwo/service-worker
$:/plugins/linonetwo/source-control-management
$:/plugins/linonetwo/sub-wiki
$:/plugins/linonetwo/zx-script
$:/plugins/mat/field-value-selector
$:/plugins/oflg/fishing
$:/plugins/oflg/fishing-analysis
$:/plugins/oflg/fishing-cannedfish
$:/plugins/oflg/fishing-cannedfish/2022黄皮书考研一大纲词汇背诵宝典
$:/plugins/oflg/fishing-catchfish
$:/plugins/oflg/fishing-twpub
$:/plugins/oflg/fishing-zh-Hans
$:/plugins/oflg/fishing/data
$:/plugins/oflg/fishing/fishingrod/[tag[?]]
$:/plugins/oflg/fishing/fishingrod/[tag[?]tag[TiddlyWiki]]
$:/plugins/oflg/fishing/fishingrod/[twpub[$:/plugins/twpub/021850e4fdbec5ff]!tag[!]]
$:/plugins/oflg/fishing/fishingrod/[twpub[$:/plugins/twpub/66297532933d6d63]!tag[!]]
$:/plugins/oflg/fishing/fishingrod/[twpub[$:/plugins/twpub/fecf535e6323269f]!tag[!]]
$:/plugins/oflg/lazy-tiddler
$:/plugins/telmiger/EditorCounter
$:/plugins/telmiger/HarveyBalls
$:/plugins/telmiger/PluginSize
$:/plugins/tiddlywiki/codemirror
$:/plugins/tiddlywiki/codemirror-autocomplete
$:/plugins/tiddlywiki/codemirror-closebrackets
$:/plugins/tiddlywiki/codemirror-closetag
$:/plugins/tiddlywiki/codemirror-keymap-sublime-text
$:/plugins/tiddlywiki/codemirror-mode-css
$:/plugins/tiddlywiki/codemirror-mode-htmlmixed
$:/plugins/tiddlywiki/codemirror-mode-javascript
$:/plugins/tiddlywiki/codemirror-mode-markdown
$:/plugins/tiddlywiki/codemirror-mode-xml
$:/plugins/tiddlywiki/codemirror-search-replace
$:/plugins/tiddlywiki/dynannotate
$:/plugins/tiddlywiki/dynaview
$:/plugins/tiddlywiki/filesystem
$:/plugins/tiddlywiki/highlight
$:/plugins/tiddlywiki/katex
$:/plugins/tiddlywiki/markdown
$:/plugins/tiddlywiki/qrcode
$:/plugins/tiddlywiki/tiddlyweb
$:/plugins/tobibeer/appear
$:/plugins/twpub/021850e4fdbec5ff
$:/plugins/twpub/66297532933d6d63
$:/plugins/twpub/fecf535e6323269f
$:/status/RequireReloadDueToPluginChange
$:/StoryList
$:/theme
$:/themes/linonetwo/itonnote
$:/themes/nico/notebook
$:/themes/tiddlywiki/vanilla
$:/themes/tiddlywiki/vanilla/metrics/sidebarbreakpoint
$:/themes/tiddlywiki/vanilla/metrics/sidebarwidth
$:/themes/tiddlywiki/vanilla/metrics/storyright
$:/themes/tiddlywiki/vanilla/metrics/storytop
$:/themes/tiddlywiki/vanilla/metrics/storywidth
$:/themes/tiddlywiki/vanilla/metrics/tiddlerwidth
$:/themes/tiddlywiki/vanilla/options/sidebarlayout
$:/themes/tiddlywiki/vanilla/settings/backgroundimage
$:/themes/tiddlywiki/vanilla/settings/backgroundimageattachment
$:/themes/tiddlywiki/vanilla/settings/backgroundimagesize
$:/themes/tiddlywiki/vanilla/settings/codefontfamily
$:/themes/tiddlywiki/vanilla/settings/editorfontfamily
$:/themes/tiddlywiki/vanilla/settings/fontfamily
$:/view
11111
69143957_BLUE0.jpg
Angular
C++
Cloze
CSS
DOM操作与性能问题
ES6
ES6新特性
Excerpt
favicon.ico
Flow
Have fun with
HTML
HTTP协议
HTTP消息的结构
HTTP的更新迭代
HTTP请求的应用场景
image.png
Index
JavaScript
JavaScript历史
JavaScript异步编程
JavaScript性能优化
JavaScript的原型和继承
LATEX
Linux
MyPromise
Node.js
Node.js模块与API
Parcel
Question
React
resolvePromise
Rollup
Sass
Sass Mixed
Select
static resolve
TCP连接建立
TheBrain
TheBrain2level.js
this与执行上下文
TiddlyMap!!
TiddlyWiki
TiddlyWikiIconBlack.png
TiddlyWikiIconBlue.png
TiddlyWikiIconWhite.png
twpub/021850e4fdbec5ff/Introduction to Algorithms, Fourth Edition
twpub/021850e4fdbec5ff/toc/app-1/A Summations
twpub/021850e4fdbec5ff/toc/app-2/B Sets, Etc.
twpub/021850e4fdbec5ff/toc/app-3/C Counting and Probability
twpub/021850e4fdbec5ff/toc/app-4/D Matrices
twpub/021850e4fdbec5ff/toc/bib-1/Bibliography
twpub/021850e4fdbec5ff/toc/chap-1/1 The Role of Algorithms in Computing
twpub/021850e4fdbec5ff/toc/chap-10/10 Elementary Data Structures
twpub/021850e4fdbec5ff/toc/chap-11/11 Hash Tables
twpub/021850e4fdbec5ff/toc/chap-12/12 Binary Search Trees
twpub/021850e4fdbec5ff/toc/chap-13/13 Red-Black Trees
twpub/021850e4fdbec5ff/toc/chap-14/14 Dynamic Programming
twpub/021850e4fdbec5ff/toc/chap-15/15 Greedy Algorithms
twpub/021850e4fdbec5ff/toc/chap-16/16 Amortized Analysis
twpub/021850e4fdbec5ff/toc/chap-17/17 Augmenting Data Structures
twpub/021850e4fdbec5ff/toc/chap-18/18 B-Trees
twpub/021850e4fdbec5ff/toc/chap-19/19 Data Structures for Disjoint Sets
twpub/021850e4fdbec5ff/toc/chap-2/2 Getting Started
twpub/021850e4fdbec5ff/toc/chap-20/20 Elementary Graph Algorithms
twpub/021850e4fdbec5ff/toc/chap-21/21 Minimum Spanning Trees
twpub/021850e4fdbec5ff/toc/chap-22/22 Single-Source Shortest Paths
twpub/021850e4fdbec5ff/toc/chap-23/23 All-Pairs Shortest Paths
twpub/021850e4fdbec5ff/toc/chap-24/24 Maximum Flow
twpub/021850e4fdbec5ff/toc/chap-25/25 Matchings in Bipartite Graphs
twpub/021850e4fdbec5ff/toc/chap-26/26 Parallel Algorithms
twpub/021850e4fdbec5ff/toc/chap-27/27 Online Algorithms
twpub/021850e4fdbec5ff/toc/chap-28/28 Matrix Operations
twpub/021850e4fdbec5ff/toc/chap-29/29 Linear Programming
twpub/021850e4fdbec5ff/toc/chap-3/3 Characterizing Running Times
twpub/021850e4fdbec5ff/toc/chap-30/30 Polynomials and the FFT
twpub/021850e4fdbec5ff/toc/chap-31/31 Number-Theoretic Algorithms
twpub/021850e4fdbec5ff/toc/chap-32/32 String Matching
twpub/021850e4fdbec5ff/toc/chap-33/33 Machine-Learning Algorithms
twpub/021850e4fdbec5ff/toc/chap-34/34 NP-Completeness
twpub/021850e4fdbec5ff/toc/chap-35/35 Approximation Algorithms
twpub/021850e4fdbec5ff/toc/chap-4/4 Divide-and-Conquer
twpub/021850e4fdbec5ff/toc/chap-5/5 Probabilistic Analysis and Randomized Algorithms
twpub/021850e4fdbec5ff/toc/chap-6/6 Heapsort
twpub/021850e4fdbec5ff/toc/chap-7/7 Quicksort
twpub/021850e4fdbec5ff/toc/chap-8/8 Sorting in Linear Time
twpub/021850e4fdbec5ff/toc/chap-9/9 Medians and Order Statistics
twpub/021850e4fdbec5ff/toc/copyright/Copyright
twpub/021850e4fdbec5ff/toc/cover/Cover
twpub/021850e4fdbec5ff/toc/indx-1/Index
twpub/021850e4fdbec5ff/toc/part-1/I Foundations
twpub/021850e4fdbec5ff/toc/part-2/II Sorting and Order Statistics
twpub/021850e4fdbec5ff/toc/part-3/III Data Structures
twpub/021850e4fdbec5ff/toc/part-4/IV Advanced Design and Analysis Techniques
twpub/021850e4fdbec5ff/toc/part-5/V Advanced Data Structures
twpub/021850e4fdbec5ff/toc/part-6/VI Graph Algorithms
twpub/021850e4fdbec5ff/toc/part-7/VII Selected Topics
twpub/021850e4fdbec5ff/toc/part-8/VIII Appendix: Mathematical Background
twpub/021850e4fdbec5ff/toc/pref-1/Preface
twpub/021850e4fdbec5ff/toc/Rh1-1/Introduction
twpub/021850e4fdbec5ff/toc/Rh1-100/Introduction
twpub/021850e4fdbec5ff/toc/Rh1-101/17.1 Dynamic order statistics
twpub/021850e4fdbec5ff/toc/Rh1-102/17.2 How to augment a data structure
twpub/021850e4fdbec5ff/toc/Rh1-103/17.3 Interval trees
twpub/021850e4fdbec5ff/toc/Rh1-106/18.1 Definition of B-trees
twpub/021850e4fdbec5ff/toc/Rh1-107/18.2 Basic operations on B-trees
twpub/021850e4fdbec5ff/toc/Rh1-108/18.3 Deleting a key from a B-tree
twpub/021850e4fdbec5ff/toc/Rh1-11/3.1 O-notation, Ω-notation, and Θ-notation
twpub/021850e4fdbec5ff/toc/Rh1-111/19.1 Disjoint-set operations
twpub/021850e4fdbec5ff/toc/Rh1-112/19.2 Linked-list representation of disjoint sets
twpub/021850e4fdbec5ff/toc/Rh1-113/19.3 Disjoint-set forests
twpub/021850e4fdbec5ff/toc/Rh1-114/19.4 Analysis of union by rank with path compression
twpub/021850e4fdbec5ff/toc/Rh1-117/Introduction
twpub/021850e4fdbec5ff/toc/Rh1-118/20.1 Representations of graphs
twpub/021850e4fdbec5ff/toc/Rh1-119/20.2 Breadth-first search
twpub/021850e4fdbec5ff/toc/Rh1-12/3.2 Asymptotic notation: formal definitions
twpub/021850e4fdbec5ff/toc/Rh1-120/20.3 Depth-first search
twpub/021850e4fdbec5ff/toc/Rh1-121/20.4 Topological sort
twpub/021850e4fdbec5ff/toc/Rh1-122/20.5 Strongly connected components
twpub/021850e4fdbec5ff/toc/Rh1-125/21.1 Growing a minimum spanning tree
twpub/021850e4fdbec5ff/toc/Rh1-126/21.2 The algorithms of Kruskal and Prim
twpub/021850e4fdbec5ff/toc/Rh1-129/22.1 The Bellman-Ford algorithm
twpub/021850e4fdbec5ff/toc/Rh1-13/3.3 Standard notations and common functions
twpub/021850e4fdbec5ff/toc/Rh1-130/22.2 Single-source shortest paths in directed acyclic graphs
twpub/021850e4fdbec5ff/toc/Rh1-131/22.3 Dijkstra’s algorithm
twpub/021850e4fdbec5ff/toc/Rh1-132/22.4 Difference constraints and shortest paths
twpub/021850e4fdbec5ff/toc/Rh1-133/22.5 Proofs of shortest-paths properties
twpub/021850e4fdbec5ff/toc/Rh1-136/23.1 Shortest paths and matrix multiplication
twpub/021850e4fdbec5ff/toc/Rh1-137/23.2 The Floyd-Warshall algorithm
twpub/021850e4fdbec5ff/toc/Rh1-138/23.3 Johnson’s algorithm for sparse graphs
twpub/021850e4fdbec5ff/toc/Rh1-141/24.1 Flow networks
twpub/021850e4fdbec5ff/toc/Rh1-142/24.2 The Ford-Fulkerson method
twpub/021850e4fdbec5ff/toc/Rh1-143/24.3 Maximum bipartite matching
twpub/021850e4fdbec5ff/toc/Rh1-146/25.1 Maximum bipartite matching (revisited)
twpub/021850e4fdbec5ff/toc/Rh1-147/25.2 The stable-marriage problem
twpub/021850e4fdbec5ff/toc/Rh1-148/25.3 The Hungarian algorithm for the assignment problem
twpub/021850e4fdbec5ff/toc/Rh1-151/Introduction
twpub/021850e4fdbec5ff/toc/Rh1-152/26.1 The basics of fork-join parallelism
twpub/021850e4fdbec5ff/toc/Rh1-153/26.2 Parallel matrix multiplication
twpub/021850e4fdbec5ff/toc/Rh1-154/26.3 Parallel merge sort
twpub/021850e4fdbec5ff/toc/Rh1-157/27.1 Waiting for an elevator
twpub/021850e4fdbec5ff/toc/Rh1-158/27.2 Maintaining a search list
twpub/021850e4fdbec5ff/toc/Rh1-159/27.3 Online caching
twpub/021850e4fdbec5ff/toc/Rh1-16/4.1 Multiplying square matrices
twpub/021850e4fdbec5ff/toc/Rh1-162/28.1 Solving systems of linear equations
twpub/021850e4fdbec5ff/toc/Rh1-163/28.2 Inverting matrices
twpub/021850e4fdbec5ff/toc/Rh1-164/28.3 Symmetric positive-definite matrices and least-squares approximation
twpub/021850e4fdbec5ff/toc/Rh1-167/29.1 Linear programming formulations and algorithms
twpub/021850e4fdbec5ff/toc/Rh1-168/29.2 Formulating problems as linear programs
twpub/021850e4fdbec5ff/toc/Rh1-169/29.3 Duality
twpub/021850e4fdbec5ff/toc/Rh1-17/4.2 Strassen’s algorithm for matrix multiplication
twpub/021850e4fdbec5ff/toc/Rh1-172/30.1 Representing polynomials
twpub/021850e4fdbec5ff/toc/Rh1-173/30.2 The DFT and FFT
twpub/021850e4fdbec5ff/toc/Rh1-174/30.3 FFT circuits
twpub/021850e4fdbec5ff/toc/Rh1-177/31.1 Elementary number-theoretic notions
twpub/021850e4fdbec5ff/toc/Rh1-178/31.2 Greatest common divisor
twpub/021850e4fdbec5ff/toc/Rh1-179/31.3 Modular arithmetic
twpub/021850e4fdbec5ff/toc/Rh1-18/4.3 The substitution method for solving recurrences
twpub/021850e4fdbec5ff/toc/Rh1-180/31.4 Solving modular linear equations
twpub/021850e4fdbec5ff/toc/Rh1-181/31.5 The Chinese remainder theorem
twpub/021850e4fdbec5ff/toc/Rh1-182/31.6 Powers of an element
twpub/021850e4fdbec5ff/toc/Rh1-183/31.7 The RSA public-key cryptosystem
twpub/021850e4fdbec5ff/toc/Rh1-184/31.8 Primality testing
twpub/021850e4fdbec5ff/toc/Rh1-187/32.1 The naive string-matching algorithm
twpub/021850e4fdbec5ff/toc/Rh1-188/32.2 The Rabin-Karp algorithm
twpub/021850e4fdbec5ff/toc/Rh1-189/32.3 String matching with finite automata
twpub/021850e4fdbec5ff/toc/Rh1-19/4.4 The recursion-tree method for solving recurrences
twpub/021850e4fdbec5ff/toc/Rh1-190/32.4 The Knuth-Morris-Pratt algorithm
twpub/021850e4fdbec5ff/toc/Rh1-191/32.5 Suffix arrays
twpub/021850e4fdbec5ff/toc/Rh1-194/33.1 Clustering
twpub/021850e4fdbec5ff/toc/Rh1-195/33.2 Multiplicative-weights algorithms
twpub/021850e4fdbec5ff/toc/Rh1-196/33.3 Gradient descent
twpub/021850e4fdbec5ff/toc/Rh1-199/34.1 Polynomial time
twpub/021850e4fdbec5ff/toc/Rh1-2/1.1 Algorithms
twpub/021850e4fdbec5ff/toc/Rh1-20/4.5 The master method for solving recurrences
twpub/021850e4fdbec5ff/toc/Rh1-200/34.2 Polynomial-time verification
twpub/021850e4fdbec5ff/toc/Rh1-201/34.3 NP-completeness and reducibility
twpub/021850e4fdbec5ff/toc/Rh1-202/34.4 NP-completeness proofs
twpub/021850e4fdbec5ff/toc/Rh1-203/34.5 NP-complete problems
twpub/021850e4fdbec5ff/toc/Rh1-206/35.1 The vertex-cover problem
twpub/021850e4fdbec5ff/toc/Rh1-207/35.2 The traveling-salesperson problem
twpub/021850e4fdbec5ff/toc/Rh1-208/35.3 The set-covering problem
twpub/021850e4fdbec5ff/toc/Rh1-209/35.4 Randomization and linear programming
twpub/021850e4fdbec5ff/toc/Rh1-21/4.6 Proof of the continuous master theorem
twpub/021850e4fdbec5ff/toc/Rh1-210/35.5 The subset-sum problem
twpub/021850e4fdbec5ff/toc/Rh1-213/Introduction
twpub/021850e4fdbec5ff/toc/Rh1-214/A.1 Summation formulas and properties
twpub/021850e4fdbec5ff/toc/Rh1-215/A.2 Bounding summations
twpub/021850e4fdbec5ff/toc/Rh1-218/B.1 Sets
twpub/021850e4fdbec5ff/toc/Rh1-219/B.2 Relations
twpub/021850e4fdbec5ff/toc/Rh1-22/4.7 Akra-Bazzi recurrences
twpub/021850e4fdbec5ff/toc/Rh1-220/B.3 Functions
twpub/021850e4fdbec5ff/toc/Rh1-221/B.4 Graphs
twpub/021850e4fdbec5ff/toc/Rh1-222/B.5 Trees
twpub/021850e4fdbec5ff/toc/Rh1-225/C.1 Counting
twpub/021850e4fdbec5ff/toc/Rh1-226/C.2 Probability
twpub/021850e4fdbec5ff/toc/Rh1-227/C.3 Discrete random variables
twpub/021850e4fdbec5ff/toc/Rh1-228/C.4 The geometric and binomial distributions
twpub/021850e4fdbec5ff/toc/Rh1-229/C.5 The tails of the binomial distribution
twpub/021850e4fdbec5ff/toc/Rh1-232/D.1 Matrices and matrix operations
twpub/021850e4fdbec5ff/toc/Rh1-233/D.2 Basic matrix properties
twpub/021850e4fdbec5ff/toc/Rh1-25/5.1 The hiring problem
twpub/021850e4fdbec5ff/toc/Rh1-26/5.2 Indicator random variables
twpub/021850e4fdbec5ff/toc/Rh1-27/5.3 Randomized algorithms
twpub/021850e4fdbec5ff/toc/Rh1-28/5.4 Probabilistic analysis and further uses of indicator random variables
twpub/021850e4fdbec5ff/toc/Rh1-3/1.2 Algorithms as a technology
twpub/021850e4fdbec5ff/toc/Rh1-31/Introduction
twpub/021850e4fdbec5ff/toc/Rh1-32/6.1 Heaps
twpub/021850e4fdbec5ff/toc/Rh1-33/6.2 Maintaining the heap property
twpub/021850e4fdbec5ff/toc/Rh1-34/6.3 Building a heap
twpub/021850e4fdbec5ff/toc/Rh1-35/6.4 The heapsort algorithm
twpub/021850e4fdbec5ff/toc/Rh1-36/6.5 Priority queues
twpub/021850e4fdbec5ff/toc/Rh1-39/7.1 Description of quicksort
twpub/021850e4fdbec5ff/toc/Rh1-40/7.2 Performance of quicksort
twpub/021850e4fdbec5ff/toc/Rh1-41/7.3 A randomized version of quicksort
twpub/021850e4fdbec5ff/toc/Rh1-42/7.4 Analysis of quicksort
twpub/021850e4fdbec5ff/toc/Rh1-45/8.1 Lower bounds for sorting
twpub/021850e4fdbec5ff/toc/Rh1-46/8.2 Counting sort
twpub/021850e4fdbec5ff/toc/Rh1-47/8.3 Radix sort
twpub/021850e4fdbec5ff/toc/Rh1-48/8.4 Bucket sort
twpub/021850e4fdbec5ff/toc/Rh1-51/9.1 Minimum and maximum
twpub/021850e4fdbec5ff/toc/Rh1-52/9.2 Selection in expected linear time
twpub/021850e4fdbec5ff/toc/Rh1-53/9.3 Selection in worst-case linear time
twpub/021850e4fdbec5ff/toc/Rh1-56/Introduction
twpub/021850e4fdbec5ff/toc/Rh1-57/10.1 Simple array-based data structures: arrays, matrices, stacks, queues
twpub/021850e4fdbec5ff/toc/Rh1-58/10.2 Linked lists
twpub/021850e4fdbec5ff/toc/Rh1-59/10.3 Representing rooted trees
twpub/021850e4fdbec5ff/toc/Rh1-6/2.1 Insertion sort
twpub/021850e4fdbec5ff/toc/Rh1-62/11.1 Direct-address tables
twpub/021850e4fdbec5ff/toc/Rh1-63/11.2 Hash tables
twpub/021850e4fdbec5ff/toc/Rh1-64/11.3 Hash functions
twpub/021850e4fdbec5ff/toc/Rh1-65/11.4 Open addressing
twpub/021850e4fdbec5ff/toc/Rh1-66/11.5 Practical considerations
twpub/021850e4fdbec5ff/toc/Rh1-69/12.1 What is a binary search tree?
twpub/021850e4fdbec5ff/toc/Rh1-7/2.2 Analyzing algorithms
twpub/021850e4fdbec5ff/toc/Rh1-70/12.2 Querying a binary search tree
twpub/021850e4fdbec5ff/toc/Rh1-71/12.3 Insertion and deletion
twpub/021850e4fdbec5ff/toc/Rh1-74/13.1 Properties of red-black trees
twpub/021850e4fdbec5ff/toc/Rh1-75/13.2 Rotations
twpub/021850e4fdbec5ff/toc/Rh1-76/13.3 Insertion
twpub/021850e4fdbec5ff/toc/Rh1-77/13.4 Deletion
twpub/021850e4fdbec5ff/toc/Rh1-8/2.3 Designing algorithms
twpub/021850e4fdbec5ff/toc/Rh1-80/Introduction
twpub/021850e4fdbec5ff/toc/Rh1-81/14.1 Rod cutting
twpub/021850e4fdbec5ff/toc/Rh1-82/14.2 Matrix-chain multiplication
twpub/021850e4fdbec5ff/toc/Rh1-83/14.3 Elements of dynamic programming
twpub/021850e4fdbec5ff/toc/Rh1-84/14.4 Longest common subsequence
twpub/021850e4fdbec5ff/toc/Rh1-85/14.5 Optimal binary search trees
twpub/021850e4fdbec5ff/toc/Rh1-88/15.1 An activity-selection problem
twpub/021850e4fdbec5ff/toc/Rh1-89/15.2 Elements of the greedy strategy
twpub/021850e4fdbec5ff/toc/Rh1-90/15.3 Huffman codes
twpub/021850e4fdbec5ff/toc/Rh1-91/15.4 Offline caching
twpub/021850e4fdbec5ff/toc/Rh1-94/16.1 Aggregate analysis
twpub/021850e4fdbec5ff/toc/Rh1-95/16.2 The accounting method
twpub/021850e4fdbec5ff/toc/Rh1-96/16.3 The potential method
twpub/021850e4fdbec5ff/toc/Rh1-97/16.4 Dynamic tables
twpub/021850e4fdbec5ff/toc/toc/Contents
twpub/66297532933d6d63/朝花夕拾
twpub/66297532933d6d63/朝花夕拾-1/*** START: FULL LICENSE ***
twpub/66297532933d6d63/朝花夕拾-2/Section 1. General Terms of Use and Redistributing Project Gutenberg-tm electronic works
twpub/66297532933d6d63/朝花夕拾-3/Section 2. Information about the Mission of Project Gutenberg-tm
twpub/66297532933d6d63/朝花夕拾-4/Section 3. Information about the Project Gutenberg Literary Archive Foundation
twpub/66297532933d6d63/朝花夕拾-5/Section 4. Information about Donations to the Project Gutenberg Literary Archive Foundation
twpub/66297532933d6d63/朝花夕拾-6/Section 5. General Information About Project Gutenberg-tm electronic works.
twpub/fecf535e6323269f/三國志
twpub/fecf535e6323269f/三國志-1/*** START: FULL LICENSE ***
twpub/fecf535e6323269f/三國志-2/Section 1. General Terms of Use and Redistributing Project Gutenberg-tm electronic works
twpub/fecf535e6323269f/三國志-3/Section 2. Information about the Mission of Project Gutenberg-tm
twpub/fecf535e6323269f/三國志-4/Section 3. Information about the Project Gutenberg Literary Archive Foundation
twpub/fecf535e6323269f/三國志-5/Section 4. Information about Donations to the Project Gutenberg Literary Archive Foundation
twpub/fecf535e6323269f/三國志-6/Section 5. General Information About Project Gutenberg-tm electronic works.
TypeScript
Vue
Web
webpack
webpack源码
Web安全
Word
WSL2代理
事件冒泡和事件委托
作用域与闭包
兴趣
其他Web安全
写作
函数式编程
制作简历
前端
前端安全
前端开发通用领域、网络、安全、算法和计算机通用知识
口语
后端
听力
大前端课程结构
娱乐
学习
学习泛化知识自检流程
学习观
实践
对EventLoop的理解
对单线程JavaScript的理解
工作
工具方法
工程化
常见的数据结构
常见页面布局技巧
幻灯片
幻灯片1
幻灯片2
开荒基础
异步事件机制
性能优化
怪物猎人
总规划
戴森球速通
手写Promise
手动链接
拉勾教育大前端高薪训练营
数学
数据库
旋元佑文法
模块化开发
浏览器
浏览器事件
浏览器加载顺序
浏览器的同源策略
浏览器的布局过程
浏览器的渲染原理
浏览器的缓存相关
游戏
用作服务端的Node.js
离散数学
筛选器
筛选器的通用形式
算法
算法与数据结构
算法相关
系统
编程
编程与设计模式
网络
网络相关
脚手架
自动化构建
英语
蓝图
规范化标准
计算机
计算机资源
计算机通用知识
词根词缀
词汇
语法
语言
软件工程
阅读
页面布局原理